Serveur d'exploration sur Mozart

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Parallel agent-based simulation on a cluster of workstations

Identifieur interne : 000199 ( PascalFrancis/Corpus ); précédent : 000198; suivant : 000200

Parallel agent-based simulation on a cluster of workstations

Auteurs : Konstantin Popov ; Vladimir Vlassov ; Mahmoud Rafea ; Fredrik Holmgren ; Per Brand ; Seif Haridi

Source :

RBID : Pascal:04-0138793

Descripteurs français

English descriptors

Abstract

We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of WWW. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multi-threading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 106 Web users on 104 Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

pA  
A01 01  1    @0 0302-9743
A05       @2 2790
A08 01  1  ENG  @1 Parallel agent-based simulation on a cluster of workstations
A09 01  1  ENG  @1 Euro-Par 2003 parallel processing : Klagenfurt, 26-29 August 2003
A11 01  1    @1 POPOV (Konstantin)
A11 02  1    @1 VLASSOV (Vladimir)
A11 03  1    @1 RAFEA (Mahmoud)
A11 04  1    @1 HOLMGREN (Fredrik)
A11 05  1    @1 BRAND (Per)
A11 06  1    @1 HARIDI (Seif)
A12 01  1    @1 KOSCH (Harald) @9 ed.
A12 02  1    @1 BOSZORMENYI (Laszlo) @9 ed.
A12 03  1    @1 HELLWAGNER (Hermann) @9 ed.
A14 01      @1 SICS @2 Kista @3 SWE @Z 1 aut. @Z 3 aut. @Z 4 aut. @Z 5 aut.
A14 02      @1 KTH/IMIT @2 Kista @3 SWE @Z 2 aut. @Z 6 aut.
A20       @1 470-480
A21       @1 2003
A23 01      @0 ENG
A26 01      @0 3-540-40788-X
A43 01      @1 INIST @2 16343 @5 354000117805180580
A44       @0 0000 @1 © 2004 INIST-CNRS. All rights reserved.
A45       @0 25 ref.
A47 01  1    @0 04-0138793
A60       @1 P @2 C
A61       @0 A
A64 01  1    @0 Lecture notes in computer science
A66 01      @0 DEU
C01 01    ENG  @0 We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of WWW. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multi-threading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 106 Web users on 104 Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.
C02 01  X    @0 001D02B04
C03 01  X  FRE  @0 Simulateur @5 01
C03 01  X  ENG  @0 Simulator @5 01
C03 01  X  SPA  @0 Simulador @5 01
C03 02  X  FRE  @0 Internet @5 02
C03 02  X  ENG  @0 Internet @5 02
C03 02  X  SPA  @0 Internet @5 02
C03 03  X  FRE  @0 Echelle grande @5 03
C03 03  X  ENG  @0 Large scale @5 03
C03 03  X  SPA  @0 Escala grande @5 03
C03 04  X  FRE  @0 Station travail @5 04
C03 04  X  ENG  @0 Workstation @5 04
C03 04  X  SPA  @0 Estación trabajo @5 04
C03 05  X  FRE  @0 Partition @5 05
C03 05  X  ENG  @0 Partition @5 05
C03 05  X  SPA  @0 Partición @5 05
C03 06  X  FRE  @0 Flot donnée @5 06
C03 06  X  ENG  @0 Data flow @5 06
C03 06  X  SPA  @0 Flujo datos @5 06
C03 07  X  FRE  @0 Développement logiciel @5 07
C03 07  X  ENG  @0 Software development @5 07
C03 07  X  SPA  @0 Desarrollo logicial @5 07
C03 08  X  FRE  @0 Site Web @5 08
C03 08  X  ENG  @0 Web site @5 08
C03 08  X  SPA  @0 Sitio Web @5 08
C03 09  X  FRE  @0 Système réparti @5 09
C03 09  X  ENG  @0 Distributed system @5 09
C03 09  X  SPA  @0 Sistema repartido @5 09
C03 10  X  FRE  @0 Séquentiel @5 11
C03 10  X  ENG  @0 Sequential @5 11
C03 10  X  SPA  @0 Secuencial @5 11
C03 11  X  FRE  @0 Réseau web @5 12
C03 11  X  ENG  @0 World wide web @5 12
C03 11  X  SPA  @0 Red WWW @5 12
C03 12  X  FRE  @0 Réponse temporelle @5 13
C03 12  X  ENG  @0 Time response @5 13
C03 12  X  SPA  @0 Respuesta temporal @5 13
C03 13  X  FRE  @0 Temps discret @5 21
C03 13  X  ENG  @0 Discrete time @5 21
C03 13  X  SPA  @0 Tiempo discreto @5 21
C03 14  X  FRE  @0 Amas @5 22
C03 14  X  ENG  @0 Cluster @5 22
C03 14  X  SPA  @0 Montón @5 22
C03 15  X  FRE  @0 Algorithme parallèle @5 23
C03 15  X  ENG  @0 Parallel algorithm @5 23
C03 15  X  SPA  @0 Algoritmo paralelo @5 23
N21       @1 089
N82       @1 PSI
pR  
A30 01  1  ENG  @1 International Euro-Par conference @2 9 @3 Klagenfurt AUT @4 2003-08-26

Format Inist (serveur)

NO : PASCAL 04-0138793 INIST
ET : Parallel agent-based simulation on a cluster of workstations
AU : POPOV (Konstantin); VLASSOV (Vladimir); RAFEA (Mahmoud); HOLMGREN (Fredrik); BRAND (Per); HARIDI (Seif); KOSCH (Harald); BOSZORMENYI (Laszlo); HELLWAGNER (Hermann)
AF : SICS/Kista/Suède (1 aut., 3 aut., 4 aut., 5 aut.); KTH/IMIT/Kista/Suède (2 aut., 6 aut.)
DT : Publication en série; Congrès; Niveau analytique
SO : Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2790; Pp. 470-480; Bibl. 25 ref.
LA : Anglais
EA : We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of WWW. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multi-threading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 106 Web users on 104 Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.
CC : 001D02B04
FD : Simulateur; Internet; Echelle grande; Station travail; Partition; Flot donnée; Développement logiciel; Site Web; Système réparti; Séquentiel; Réseau web; Réponse temporelle; Temps discret; Amas; Algorithme parallèle
ED : Simulator; Internet; Large scale; Workstation; Partition; Data flow; Software development; Web site; Distributed system; Sequential; World wide web; Time response; Discrete time; Cluster; Parallel algorithm
SD : Simulador; Internet; Escala grande; Estación trabajo; Partición; Flujo datos; Desarrollo logicial; Sitio Web; Sistema repartido; Secuencial; Red WWW; Respuesta temporal; Tiempo discreto; Montón; Algoritmo paralelo
LO : INIST-16343.354000117805180580
ID : 04-0138793

Links to Exploration step

Pascal:04-0138793

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Parallel agent-based simulation on a cluster of workstations</title>
<author>
<name sortKey="Popov, Konstantin" sort="Popov, Konstantin" uniqKey="Popov K" first="Konstantin" last="Popov">Konstantin Popov</name>
<affiliation>
<inist:fA14 i1="01">
<s1>SICS</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Vlassov, Vladimir" sort="Vlassov, Vladimir" uniqKey="Vlassov V" first="Vladimir" last="Vlassov">Vladimir Vlassov</name>
<affiliation>
<inist:fA14 i1="02">
<s1>KTH/IMIT</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Rafea, Mahmoud" sort="Rafea, Mahmoud" uniqKey="Rafea M" first="Mahmoud" last="Rafea">Mahmoud Rafea</name>
<affiliation>
<inist:fA14 i1="01">
<s1>SICS</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Holmgren, Fredrik" sort="Holmgren, Fredrik" uniqKey="Holmgren F" first="Fredrik" last="Holmgren">Fredrik Holmgren</name>
<affiliation>
<inist:fA14 i1="01">
<s1>SICS</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name>
<affiliation>
<inist:fA14 i1="01">
<s1>SICS</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name>
<affiliation>
<inist:fA14 i1="02">
<s1>KTH/IMIT</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">04-0138793</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0138793 INIST</idno>
<idno type="RBID">Pascal:04-0138793</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000199</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Parallel agent-based simulation on a cluster of workstations</title>
<author>
<name sortKey="Popov, Konstantin" sort="Popov, Konstantin" uniqKey="Popov K" first="Konstantin" last="Popov">Konstantin Popov</name>
<affiliation>
<inist:fA14 i1="01">
<s1>SICS</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Vlassov, Vladimir" sort="Vlassov, Vladimir" uniqKey="Vlassov V" first="Vladimir" last="Vlassov">Vladimir Vlassov</name>
<affiliation>
<inist:fA14 i1="02">
<s1>KTH/IMIT</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Rafea, Mahmoud" sort="Rafea, Mahmoud" uniqKey="Rafea M" first="Mahmoud" last="Rafea">Mahmoud Rafea</name>
<affiliation>
<inist:fA14 i1="01">
<s1>SICS</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Holmgren, Fredrik" sort="Holmgren, Fredrik" uniqKey="Holmgren F" first="Fredrik" last="Holmgren">Fredrik Holmgren</name>
<affiliation>
<inist:fA14 i1="01">
<s1>SICS</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name>
<affiliation>
<inist:fA14 i1="01">
<s1>SICS</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name>
<affiliation>
<inist:fA14 i1="02">
<s1>KTH/IMIT</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint>
<date when="2003">2003</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Cluster</term>
<term>Data flow</term>
<term>Discrete time</term>
<term>Distributed system</term>
<term>Internet</term>
<term>Large scale</term>
<term>Parallel algorithm</term>
<term>Partition</term>
<term>Sequential</term>
<term>Simulator</term>
<term>Software development</term>
<term>Time response</term>
<term>Web site</term>
<term>Workstation</term>
<term>World wide web</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Simulateur</term>
<term>Internet</term>
<term>Echelle grande</term>
<term>Station travail</term>
<term>Partition</term>
<term>Flot donnée</term>
<term>Développement logiciel</term>
<term>Site Web</term>
<term>Système réparti</term>
<term>Séquentiel</term>
<term>Réseau web</term>
<term>Réponse temporelle</term>
<term>Temps discret</term>
<term>Amas</term>
<term>Algorithme parallèle</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of WWW. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multi-threading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 10
<sup>6</sup>
Web users on 10
<sup>4</sup>
Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.</div>
</front>
</TEI>
<inist>
<standard h6="B">
<pA>
<fA01 i1="01" i2="1">
<s0>0302-9743</s0>
</fA01>
<fA05>
<s2>2790</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG">
<s1>Parallel agent-based simulation on a cluster of workstations</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG">
<s1>Euro-Par 2003 parallel processing : Klagenfurt, 26-29 August 2003</s1>
</fA09>
<fA11 i1="01" i2="1">
<s1>POPOV (Konstantin)</s1>
</fA11>
<fA11 i1="02" i2="1">
<s1>VLASSOV (Vladimir)</s1>
</fA11>
<fA11 i1="03" i2="1">
<s1>RAFEA (Mahmoud)</s1>
</fA11>
<fA11 i1="04" i2="1">
<s1>HOLMGREN (Fredrik)</s1>
</fA11>
<fA11 i1="05" i2="1">
<s1>BRAND (Per)</s1>
</fA11>
<fA11 i1="06" i2="1">
<s1>HARIDI (Seif)</s1>
</fA11>
<fA12 i1="01" i2="1">
<s1>KOSCH (Harald)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1">
<s1>BOSZORMENYI (Laszlo)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1">
<s1>HELLWAGNER (Hermann)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01">
<s1>SICS</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</fA14>
<fA14 i1="02">
<s1>KTH/IMIT</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>6 aut.</sZ>
</fA14>
<fA20>
<s1>470-480</s1>
</fA20>
<fA21>
<s1>2003</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA26 i1="01">
<s0>3-540-40788-X</s0>
</fA26>
<fA43 i1="01">
<s1>INIST</s1>
<s2>16343</s2>
<s5>354000117805180580</s5>
</fA43>
<fA44>
<s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45>
<s0>25 ref.</s0>
</fA45>
<fA47 i1="01" i2="1">
<s0>04-0138793</s0>
</fA47>
<fA60>
<s1>P</s1>
<s2>C</s2>
</fA60>
<fA61>
<s0>A</s0>
</fA61>
<fA64 i1="01" i2="1">
<s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01">
<s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG">
<s0>We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of WWW. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multi-threading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 10
<sup>6</sup>
Web users on 10
<sup>4</sup>
Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.</s0>
</fC01>
<fC02 i1="01" i2="X">
<s0>001D02B04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE">
<s0>Simulateur</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG">
<s0>Simulator</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA">
<s0>Simulador</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE">
<s0>Internet</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG">
<s0>Internet</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA">
<s0>Internet</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE">
<s0>Echelle grande</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG">
<s0>Large scale</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA">
<s0>Escala grande</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE">
<s0>Station travail</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG">
<s0>Workstation</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA">
<s0>Estación trabajo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE">
<s0>Partition</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG">
<s0>Partition</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA">
<s0>Partición</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE">
<s0>Flot donnée</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG">
<s0>Data flow</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA">
<s0>Flujo datos</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE">
<s0>Développement logiciel</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG">
<s0>Software development</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA">
<s0>Desarrollo logicial</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE">
<s0>Site Web</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG">
<s0>Web site</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA">
<s0>Sitio Web</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE">
<s0>Système réparti</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG">
<s0>Distributed system</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA">
<s0>Sistema repartido</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE">
<s0>Séquentiel</s0>
<s5>11</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG">
<s0>Sequential</s0>
<s5>11</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA">
<s0>Secuencial</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE">
<s0>Réseau web</s0>
<s5>12</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG">
<s0>World wide web</s0>
<s5>12</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA">
<s0>Red WWW</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE">
<s0>Réponse temporelle</s0>
<s5>13</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG">
<s0>Time response</s0>
<s5>13</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA">
<s0>Respuesta temporal</s0>
<s5>13</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE">
<s0>Temps discret</s0>
<s5>21</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG">
<s0>Discrete time</s0>
<s5>21</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA">
<s0>Tiempo discreto</s0>
<s5>21</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE">
<s0>Amas</s0>
<s5>22</s5>
</fC03>
<fC03 i1="14" i2="X" l="ENG">
<s0>Cluster</s0>
<s5>22</s5>
</fC03>
<fC03 i1="14" i2="X" l="SPA">
<s0>Montón</s0>
<s5>22</s5>
</fC03>
<fC03 i1="15" i2="X" l="FRE">
<s0>Algorithme parallèle</s0>
<s5>23</s5>
</fC03>
<fC03 i1="15" i2="X" l="ENG">
<s0>Parallel algorithm</s0>
<s5>23</s5>
</fC03>
<fC03 i1="15" i2="X" l="SPA">
<s0>Algoritmo paralelo</s0>
<s5>23</s5>
</fC03>
<fN21>
<s1>089</s1>
</fN21>
<fN82>
<s1>PSI</s1>
</fN82>
</pA>
<pR>
<fA30 i1="01" i2="1" l="ENG">
<s1>International Euro-Par conference</s1>
<s2>9</s2>
<s3>Klagenfurt AUT</s3>
<s4>2003-08-26</s4>
</fA30>
</pR>
</standard>
<server>
<NO>PASCAL 04-0138793 INIST</NO>
<ET>Parallel agent-based simulation on a cluster of workstations</ET>
<AU>POPOV (Konstantin); VLASSOV (Vladimir); RAFEA (Mahmoud); HOLMGREN (Fredrik); BRAND (Per); HARIDI (Seif); KOSCH (Harald); BOSZORMENYI (Laszlo); HELLWAGNER (Hermann)</AU>
<AF>SICS/Kista/Suède (1 aut., 3 aut., 4 aut., 5 aut.); KTH/IMIT/Kista/Suède (2 aut., 6 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2790; Pp. 470-480; Bibl. 25 ref.</SO>
<LA>Anglais</LA>
<EA>We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of WWW. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multi-threading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 10
<sup>6</sup>
Web users on 10
<sup>4</sup>
Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.</EA>
<CC>001D02B04</CC>
<FD>Simulateur; Internet; Echelle grande; Station travail; Partition; Flot donnée; Développement logiciel; Site Web; Système réparti; Séquentiel; Réseau web; Réponse temporelle; Temps discret; Amas; Algorithme parallèle</FD>
<ED>Simulator; Internet; Large scale; Workstation; Partition; Data flow; Software development; Web site; Distributed system; Sequential; World wide web; Time response; Discrete time; Cluster; Parallel algorithm</ED>
<SD>Simulador; Internet; Escala grande; Estación trabajo; Partición; Flujo datos; Desarrollo logicial; Sitio Web; Sistema repartido; Secuencial; Red WWW; Respuesta temporal; Tiempo discreto; Montón; Algoritmo paralelo</SD>
<LO>INIST-16343.354000117805180580</LO>
<ID>04-0138793</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000199 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000199 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    MozartV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:04-0138793
   |texte=   Parallel agent-based simulation on a cluster of workstations
}}

Wicri

This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023